Interpretation of the Deductive Tableau in HOL
نویسندگان
چکیده
Our research investigates frameworks supporting the formalization of programming calculi and their application to deduction-based program synthesis. Here we report on a case study: within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development which can simulate those of the deductive tableau proposed by Manna and Waldinger. We have used the resulting theory to synthesize a library of verified programs, focusing in particular on sorting algorithms. Our experience suggests that the methodology we propose is well suited both to implement and use programming calculi, extend them, partially automate them, and even formally reason about their correctness.
منابع مشابه
J. Symbolic Computation (1999) 11, 1{39 A Higher-Order Interpretation of Deductive Tableau
The Deductive Tableau of Manna and Waldinger is a formal system with an associated methodology for synthesizing functional programs by existence proofs in classical rst-order theories. We reinterpret the formal system in a setting that is higher-order in two respects: higher-order logic is used to formalize a theory of functional programs and higher-order resolution is used to synthesize progra...
متن کاملAccelerating Tableaux Proofs Using Compact Representations
In this article a modiied form of tableau calculus, called Tableau Graph Calculus, is presented for overcoming the well-known ineeciencies of the traditional tableau calculus to a large extent. This calculus is based on a compact representation of analytic tableaux by using graph structures called tableau graphs. These graphs are obtained from the input formula in linear time and incorporate mo...
متن کاملcient Representation and Computation ofTableaux
The current rst-order automatic prover FAUST, embedded in HOL, is based on a sequent calculus which is quite slow and memory intensive. In this paper, an improved version of FAUST using a modiied form of tableau calculus called Tableau Graph Calculus is presented which overcomes the well-known ineeciencies of the traditional tableau calculus to a large extent. This calculus works on a compact r...
متن کاملLabelled Tableau Calculi Generating Simple Models for Substructural Logics∗
In this paper we apply the methodology of Labelled Deductive Systems to the tableau method in order to obtain a deductive framework for substructural logics which incorporates the facility of model generation. For this special purpose, we propose new labelled tableau calculi TL and TLe for two substructural logics L (essentially the Lambek calculus) and Le (the multiplicative fragment of intuit...
متن کاملA Case Study Using Timed Transition Diagrams and the HOL Theorem Prover for the Formal Development of a Production Cell
This report illustrates the use of hierarchical timed transition diagrams (HTTDs) and the HOL theorem prover for the formal speciication and veriication of a production cell. The speciication generalizes the geometries and component speeds of the production cell, real-time behaviour is modelled, and veriication is by partially automated deductive proof using the HOL system.
متن کامل